Monte Carlo Hidden Markov Models
نویسندگان
چکیده
We present a learning algorithm for hidden Markov models with continuous state and observation spaces. All necessary probability density functions are approximated using samples, along with density trees generated from such samples. A Monte Carlo version of Baum-Welch (EM) is employed to learn models from data, just as in regular HMM learning. Regularization during learning is obtained using an exponential shrinking technique. The shrinkage factor, which determines the effective capacity of the learning algorithm, is annealed down over multiple iterations of Baum-Welch, and early stopping is applied to select the right model. We prove that under mild assumptions, Monte Carlo Hidden Markov Models converge to a local maximum in likelihood space, just like conventional HMMs. In addition, we provide empirical results obtained in a gesture recognition domain, which illustrate the appropriateness of the approach in practice.
منابع مشابه
Bayesian Inference in Hidden Markov Models through Reversible Jump Markov Chain Monte Carlo
Hidden Markov models form an extension of mixture models providing a ex-ible class of models exhibiting dependence and a possibly large degree of variability. In this paper we show how reversible jump Markov chain Monte Carlo techniques can be used to estimate the parameters as well as the number of components of a hidden Markov model in a Bayesian framework. We employ a mixture of zero mean no...
متن کاملMCMC for hidden continuous - time
Hidden Markov models have proved to be a very exible class of models, with many and diverse applications. Recently Markov chain Monte Carlo (MCMC) techniques have provided powerful computational tools to make inferences about the parameters of hidden Markov models, and about the unobserved Markov chain, when the chain is deened in discrete time. We present a general algorithm, based on reversib...
متن کاملBayesian Hidden Markov Models for Financial Data
Hidden Markov Models, also known as Markov Switching Models, can be considered an extension of mixture models, allowing for dependent observations. The main problem associated with Hidden Markov Models is represented by the choice of the number of regimes, i.e. the number of the generating data processes, which differ one from another just for the value of the parameters. Applying a hierarchica...
متن کاملJoint Modeling of Dynamic and Cross-Sectional Heterogeneity: Introducing Hidden Markov Panel Models
Researchers working with panel data sets often face situations where changes in unobserved factors have produced changes in the cross-sectional heterogeneity across time periods. Unfortunately, conventional statistical methods for panel data are based on the assumption that the unobserved cross-sectional heterogeneity is time constant. In this paper, I introduce statistical methods to diagnose ...
متن کاملBayesian inference for Hidden Markov Models
Hidden Markov Models can be considered an extension of mixture models, allowing for dependent observations. In a hierarchical Bayesian framework, we show how Reversible Jump Markov Chain Monte Carlo techniques can be used to estimate the parameters of a model, as well as the number of regimes. We consider a mixture of normal distributions characterized by different means and variances under eac...
متن کامل